A Proof of the Marcinkiewicz-Zygmund Inequality on the Bi-Sphere
نویسندگان
چکیده
In this technical report we present a complete proof of the Marcinkiewicz-Zygmund inequality on the bi-Sphere from [1, Theorem 4.5]. We use the same notation as in [1]. The Theorem 4.5 of [1] reads as follows: Theorem 1. Let N ∈ N2 and R be a admissible decomposition of S2 × S2 according to a sampling set X such that ‖R‖ ≤ η 21 Ñ , (1) where η ∈ (0, 1) is arbitrarily fixed. Then for r = 1 or r =∞ and any p ∈ ΠN , we have (1− η) ‖p‖S2×S2,r ≤ ‖p‖X ,r ≤ (1 + η) ‖p‖S2×S2,r. (2) We apply subsequently the following inequalities: Lemma 2. The following estimates are valid, (i) max t∈[0,π] |vN (cos t)| ≤ 1 π N, (ii) ∫ ξ ξ− j ∣∣ d dt vN (cos t) ∣∣ dt ≤ 2 π N ‖R‖, (iii) ∫ π−‖R‖ ‖R‖ ∣∣ d dt vN (cos t) ∣∣ sin t dt ≤ 3 2π (5N + 1). Proof of Lemma 2: From [2, equations (3.13), (3.14)], we obtain immediately the inequality (i). Using the Bernstein inequality ‖T ‖∞ ≤ 2N‖T‖∞ for vN (cos t) and (i) we get (ii). The integral in (iii) can be estimated as in the proof of Theorem 4.2 in [2]. Proof of Theorem 1: We start with the case r =∞. For proving the left-hand side let (x,y) ∈ S2 × S2 an arbitrary fixed point and assume that (u,v) ∈ X is a point with d((x,y), (u,v)) = d((x,y),X ) = δX . We conclude by [1, Lemma 4.4] |p(x,y)| ≤ |p(x,y)− p(u,v)|+ |p(u,v)| ≤ 2Ñ d ((x,y), (u,v)) ‖p‖S2×S2,∞ + max j=1,...,M |p(xj ,yj)| .
منابع مشابه
Scattered data approximation on the bi-sphere and application to texture analysis
The paper deals with the approximation and optimal interpolation of functions defined on the bisphere S × S from scattered data. We demonstrate how the least square approximation to the function can be computed in a stable and efficient manner. The analysis of this problem is based on Marcinkiewicz–Zygmund inequalities for scattered data which we present here for the bisphere. The complementary...
متن کاملMarcinkiewicz-Zygmund inequalities
We study a generalization of the classical Marcinkiewicz-Zygmund inequalities. We relate this problem to the sampling sequences in the Paley-Wiener space and by using this analogy we give sharp necessary and sufficient computable conditions for a family of points to satisfy the Marcinkiewicz-Zygmund inequalities.
متن کاملPolynomial approximation on the sphere using scattered data
We consider the problem of approximately reconstructing a function f defined on the surface of the unit sphere in the Euclidean space R, using samples of f at scattered sites. A central role is played by the construction of a new operator for polynomial approximation, which is a uniformly bounded quasi–projection in the de la Vallée Poussin style, i.e. it reproduces spherical polynomials up to ...
متن کاملEquidistribution of Fekete Points on the Sphere
Fekete points are the points that maximize a Vandermonde-type determinant that appears in the polynomial Lagrange interpolation formula. They are well suited points for interpolation formulas and numerical integration. We prove the asymptotic equidistribution of Fekete points in the sphere. The way we proceed is by showing their connection to other arrays of points, the so-called Marcinkiewicz-...
متن کاملEquidistribution of the Fekete Points on the Sphere
The Fekete points are the points that maximize a Vandermonde-type determinant that appears in the polynomial Lagrange interpolation formula. They are well suited points for interpolation formulas and numerical integration. We prove the asymptotic equidistribution of the Fekete points in the sphere. The way we proceed is by showing their connection with other array of points, the Marcinkiewicz-Z...
متن کامل